Runtime Performance Analysis of the M - to - N Scheduling
نویسنده
چکیده
The popular M-toN thread scheduling model multiplexes many user-level threads on top of fewer kernel-level threads. While this model is designed to be scalable and eecient without excessive resource consumption, we isolate several elementary examples under which the M-toN model exhibits highly nonintuitive performance. We use a runtime performance monitor for multithreaded programs which we have developed, ThreadMon, to explain the causes of the unexpected results. We conclude that the complexity and nondeterminism exported to the programmer make performance tuning to the intricate M-toN model extremely diicult. Moreover, we show that the insulation of user-level scheduling from kernel-level scheduling can have undesirable side-eeects.
منابع مشابه
TASA: A New Task Scheduling Algorithm in Cloud Computing
Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. It merges a lot of physical resources and offers them to users as services according to service level agreement. Therefore, resource management alongside with task scheduling has direct influence on cloud networks’ performance and efficiency. Presenting a proper scheduling ...
متن کاملPreventing Key Performance Indicators Violations Based on Proactive Runtime Adaptation in Service Oriented Environment
Key Performance Indicator (KPI) is a type of performance measurement that evaluates the success of an organization or a partial activity in which it engages. If during the running process instance the monitoring results show that the KPIs do not reach their target values, then the influential factors should be identified, and the appropriate adaptation strategies should be performed to prevent ...
متن کاملMulti-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملScheduling Nurse Shifts Using Goal Programming Based on Nurse Preferences: A Case Study in an Emergency Department
Nowadays, nurses scheduling is one of the most important challenges with which health care centers are encountered. The significance of nurses’ work quality has led researchers to be concerned about scheduling problems, which have an impact on nurses’ performance. Observing the interests of hospital and patients, providing their satisfaction, and meeting their needs are among the main objective...
متن کاملBi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem
This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
متن کامل